Reed–Muller codes and permutation decoding
نویسندگان
چکیده
منابع مشابه
Partial permutation decoding for binary Hadamard codes
Roland D. Barrolleta – Partial permutation decoding for binary Hadamard codes 1 Johann A. Briffa – Codes for Synchronization Error Correction 2 Wouter Castryck – Some two-torsion issues for curves in characteristic two 4 Gábor Fodor – Fingerprinting codes and their limits 5 E. Suárez-Canedo – About a class of Hadamard Propelinear Codes 6 Andrea Švob – On some transitive combinatorial structures...
متن کاملPartial permutation decoding for codes from Paley
We examine codes from the Paley graphs for the purpose of permutation decoding and observe that after a certain length, PD-sets to correct errors up to the code’s error-capability will not exist. In this paper we construct small sets of permutations for correcting two errors by permutation decoding for the case where the codes have prime length.
متن کاملIterative Soft Permutation Decoding of Product Codes
In this paper the performance of product codes based on quadratic residue codes is investigated. Our Proposed Iterative decoding SISO based on a soft permutation decoding algorithm (SPDA) as a component decoder. Numerical result for the proposed algorithm over Additive White Gaussian Noise (AWGN) channel is provided. Results show that the turbo effect of the proposed decoder algorithm is establ...
متن کاملPermutation decoding of ℤ2ℤ4-linear codes
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As a ...
متن کاملPartial permutation decoding for simplex codes
We show how to find s-PD-sets of size s+1 that satisfy the Gordon-Schönheim bound for partial permutation decoding for the binary simplex codes Sn(F2) for all n ≥ 4, and for all values of s up to ⌊ 2−1 n ⌋ − 1. The construction also applies to the q-ary simplex codes Sn(Fq) for q > 2, and to s-antiblocking information systems of size s+ 1, for s up to ⌊ (q−1)/(q−1) n ⌋ − 1 for all q.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.06.001